Structuring textbook proofs
نویسنده
چکیده
Topic Areas or Theme ID: discourse analysis, discourse segmentation, discourse plans Word Count: 3196 words (excluding gures) Under consideration for other conferences (specify)? No. Abstract We propose a promising research problem, the machine veriication of textbook proofs. It shows that textbook proofs are a suuciently complex and highly struc-tured form of discourse, embedded in a well-deened and well-understood domain, thus ooering an ideal domain for discourse analysis. Because recognizing the structure of a proof is a prerequisite for verifying the correctness of a given mathematical argument, we deene a four component model of discourse segmentation.
منابع مشابه
Verifying and Invalidating Textbook Proofs Using Scunak
Many textbook proofs are essentially human-readable representations of natural deduction proofs. Terms in dependent type theory provide formally checkable representations of natural deduction proofs. We show how the new mathematical assistant system Scunak can be used to verify a textbook proof by translating the LTEX version into a proof term in a dependent type theory. We also show how Scunak...
متن کاملLearning how to Prove: From the Coq Proof Assistant to Textbook Style
We have developed an alternative approach to teaching computer science students how to prove. First, students are taught how to prove theorems with the Coq proof assistant. In a second, more difficult, step students will transfer their acquired skills to the area of textbook proofs. In this article we present a realisation of the second step. Proofs in Coq have a high degree of formality while ...
متن کاملChecking textbook proofs
discourse entities have been studied extensively by Asher [2]. Asherdi ers between fact anaphora, event anaphora, concept anaphora and proposi-tion anaphora. For our domain, only the latter is of interest. The DRS construc-tion process we described begs some similarities to the one described in [2]. Amajor di erence is that, due to our domain, (i) we can assume the existence of<...
متن کاملA Drt-based Approach for Formula Parsing in Textbook Proofs
Knowledge is essential for understanding discourse. Generally, this has to be common sense knowledge and therefore, discourse understanding is hard. For the understanding of textbook proofs, however, only a limited quantity of knowledge is necessary. In addition, we have gained something very essential: inference. A prerequisite for parsing textbook proofs is to being able to parse formulae tha...
متن کاملTowards the Mechanical Verification of Textbook Proofs
Our goal is to implement a program for the machine verification of textbook proofs. We study the task from both the linguistics and automated reasoning perspective and give an in-depth analysis for a sample textbook proof. We propose a framework for natural language proof understanding that extends and integrates state-of-the-art technologies from Natural Language Processing (Discourse Represen...
متن کامل